Hybrid processor to compute invariant moments for pattern recognition.
نویسندگان
چکیده
The use of invariant moments" 2 for pattern recognition and scene matching has received considerable attention.1-8 The majority of this work has utilized digital processors. 3 -6 In this Letter, we describe a hybrid optical-digital system that can compute all the invariant moments of a 2-D image in parallel by spatial convolution. This is an extension of earlier work7 that required separate masks for each moment computation and differs from other optical methods8 that use differentiation and Fourier transformation.
منابع مشابه
On Pattern Classification Using Statistical Moments
Selecting appropriate feature extraction method is absolutely one of the most important factors to archive high classification performance in pattern recognition systems. Among different feature extraction methods proposed for pattern recognition, statistical moments seem to be so promising. Whereas theoretical comparison of the moments is too complicated, in this paper, an experimental evaluat...
متن کاملOrthogonal Fourier-Mellin moments for invariant pattern recognition
Received July 7, 1993; revised manuscript received November 22, 1993; accepted December 14, 1993 We propose orthogonal Fourier-Mellin moments, which are more suitable than Zernike moments, for scaleand rotation-invariant pattern recognition. The new orthogonal radial polynomials have more zeros than do the Zernike radial polynomials in the region of small radial distance. The orthogonal Fourier...
متن کاملTranslation invariants of Zernike moments
Moment functions de0ned using a polar coordinate representation of the image space, such as radial moments and Zernike moments, are used in several recognition tasks requiring rotation invariance. However, this coordinate representation does not easily yield translation invariant functions, which are also widely sought after in pattern recognition applications. This paper presents a mathematica...
متن کاملA comparative analysis of algorithms for fast computation of Zernike moments
This paper details a comparative analysis on time taken by the present and proposed methods to compute the Zernike moments, Zpq. The present method comprises of Direct, Belkasim’s, Prata’s, Kintner’s and Coe3cient methods. We propose a new technique, denoted as q-recursive method, speci5cally for fast computation of Zernike moments. It uses radial polynomials of 5xed order p with a varying inde...
متن کاملDPML-Risk: An Efficient Algorithm for Image Registration
Targets and objects registration and tracking in a sequence of images play an important role in various areas. One of the methods in image registration is feature-based algorithm which is accomplished in two steps. The first step includes finding features of sensed and reference images. In this step, a scale space is used to reduce the sensitivity of detected features to the scale changes. Afterw...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Optics letters
دوره 5 9 شماره
صفحات -
تاریخ انتشار 1980